منابع مشابه
Tree games with regular objectives
We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity. Mio showed that tree games are able to encode Blackwell games and, consequently, are not determined under deterministic strategies. We show that non-stochastic tree games with objectives recognisable by so-called game automata are determined unde...
متن کاملGames with lexicographically ordered $\omega$-regular objectives
In recent years, two-player zero-sum games with multidimensional objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, player 1 wins if he can ensure that all objectives are satisfied against any behavior of player 2. It is however often natural to provide more significance to one objective over another, a situation that can be m...
متن کاملNetwork-Formation Games with Regular Objectives
Classical network-formation games are played on a directed graph. Players have reachability objectives, and each player has to select a path satisfying his objective. Edges are associated with costs, and when several players use the same edge, they evenly share its cost. The theoretical and practical aspects of network-formation games have been extensively studied and are well understood. We in...
متن کاملGames with lexicographically ordered $ω$-regular objectives
In recent years, two-player zero-sum games with multidimensional objectives have received a lot of interest as a model for intricate systems that are required to satisfy several properties. In this framework, player 1 wins if he can ensure that all objectives are satisfied against any behavior of player 2. It is however often natural to provide more significance to one objective over another, a...
متن کاملConcurrent Games with Tail Objectives
We study infinite stochastic games played by two-players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceeds for infinite numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.161.20